Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable codes whose synchronization capabilities attain the upper bound. The method is applicable to cyclic codes of prime length

Secure Transmission for Relay Wiretap Channels in the Presence of Spatially Random Eavesdroppers

We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is equipped with multiple antennas, whereas the relay, the destination, and the eavesdroppers are equipped with a single antenna each. In the proposed scheme, in addition to information signals, the source transmits artificial noise signals in order to confuse the eavesdroppers. With the target of maximizing the secrecy throughput of the relay wiretap channel, we derive a closed-form expression for the transmission outage probability and an easy-to-compute expression for the secrecy outage probability. Using these expressions, we determine the optimal power allocation factor and wiretap code rates that guarantee the maximum secrecy throughput, while satisfying a secrecy outage probability constraint. Furthermore, we examine the impact of source antenna number on the secrecy throughput, showing that adding extra transmit antennas at the source brings about a significant increase in the secrecy throughput.Comment: 7 pages, 5 figures, accepted by IEEE Globecom 2015 Workshop on Trusted Communications with Physical Layer Securit

Multiuser Precoding and Channel Estimation for Hybrid Millimeter Wave MIMO Systems

In this paper, we develop a low-complexity channel estimation for hybrid millimeter wave (mmWave) systems, where the number of radio frequency (RF) chains is much less than the number of antennas equipped at each transceiver. The proposed channel estimation algorithm aims to estimate the strongest angle-of-arrivals (AoAs) at both the base station (BS) and the users. Then all the users transmit orthogonal pilot symbols to the BS via these estimated strongest AoAs to facilitate the channel estimation. The algorithm does not require any explicit channel state information (CSI) feedback from the users and the associated signalling overhead of the algorithm is only proportional to the number of users, which is significantly less compared to various existing schemes. Besides, the proposed algorithm is applicable to both non-sparse and sparse mmWave channel environments. Based on the estimated CSI, zero-forcing (ZF) precoding is adopted for multiuser downlink transmission. In addition, we derive a tight achievable rate upper bound of the system. Our analytical and simulation results show that the proposed scheme offer a considerable achievable rate gain compared to fully digital systems, where the number of RF chains equipped at each transceiver is equal to the number of antennas. Furthermore, the achievable rate performance gap between the considered hybrid mmWave systems and the fully digital system is characterized, which provides useful system design insights.Comment: 6 pages, accepted for presentation, ICC 201